Strictness analysis via abstract interpretation for recursively defined types
نویسندگان
چکیده
منابع مشابه
Type Inference, Abstract Interpretation and Strictness Analysis
Coppo, M. and A. Ferrari, Type inference, abstract interpretation and strictness analysis, Theoretical Computer Science 121 (1993) 113-143. Filter domains (Coppo et al., 1984) can be seen as abstract domains for the interpretation of (functional) type-free programming languages. What is remarkable is the fact that in filter domains the interpretation of a term is given by the set of its types i...
متن کاملInterpretations of Recursively Defined Types
We consider a type system where types are labeled, regular trees. Equipped with a type ordering, it forms the basis for a polymorphic, imperative programming language. This paper studies interpretations, which are homomorphic, monotonic functions from types to sets of values. We show that they form a partial order with a minimal and a maximal element, and various characterizations of other inte...
متن کاملBinding-Time Analysis and Strictness Analysis by Abstract Interpretation
Given a description of inputs and parameters in a program, a Binding-Time Analysis determines parts of a program which can be evaluated at compile-time. A Strictness Analysis determines parts of a program, whose early evaluation does not change the value of the result. In this paper , we present an analysis which subsumes both analyses for a rst-order functional language. The analysis is formul...
متن کاملDominance Analysis via Ownership Types and Abstract Interpretation
Ownership types provide a declarative way to statically structure the topology of the heap and control aliasing in object-oriented programs. However, the relation between systematically derived static program analyses by abstract interpretation and semantic properties enforced by ownership types has not yet been investigated. In this work we build a framework to statically compute an abstract o...
متن کاملComposition Theorems for Generalized Sum and Recursively Defined Types
Composition theorems are tools which reduce reasoning about compound data structures to reasoning about their parts. For example, the truth value of a sentence about the Cartesian product of two structures can be reduced to the truth values of sentences on the components of the product. A seminal example of a compositional theorem is the Feferman-Vaught Theorem [2]. Feferman and Vaught introduc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1992
ISSN: 0890-5401
DOI: 10.1016/0890-5401(92)90028-e